A New Group Membership Protocol in Synchronous Distributed Systems
نویسندگان
چکیده
In distributed systems, a group of computer should continue to do cooperation in order to finish some jobs. In such a system, a group membership protocol is especially practical and important elements to provide processes in a group with a consistent common knowledge about the membership of the group. Whenever a membership change occurs, processes should agree on which of them should do to accomplish an unfinished job or begins a new job. The problem of knowing a stable membership view is very same with the agreeing common predicate in a distributed system such as the consensus problem. Based on the termination detection protocol that is traditional one in asynchronous distributed systems, we present the new group membership protocol in arbitrary wired networks. Key-words Synchronous Distributed Systems; Group membership; Fault Tolerance; Wired Arbitrary Network
منابع مشابه
A Hierarchical Membership Protocol for Synchronous Distributed Systems
A membership service for a synchronous distributed computer system is described. The system is assumed to be composed of groups in which a relatively frequent message exchange occurs. A hierarchy of connected groups constitutes a connected network. The membership service protocol reeects this hierarchical structure. The protocol tolerates timing, omission and crash failures. Time-bounds are spe...
متن کاملGroup membership protocol: specification and verification
According to the Evolving Algebra thesis [3], evolving algebras should allow one to specify succinctly any algorithm. There exists substantial evidence con rming this thesis in the case of sequential algorithms (see the annotated bibliography in [3]). In other papers, e.g., [1, 5], evolving algebras are used to specify distributed algorithms. For this paper, we wanted to look at a time-constrai...
متن کاملAutomated Addition of Fault-Tolerance under Synchronous Semantics
We focus on the problem of automated model repair for synchronous systems. Model repair focuses on revising a model, so that it satisfies a new property while preserving its existing properties. While the problem of model repair has been studied previously in the context of interleaving semantics, we argue that the corresponding solutions are not applicable for several problems encountered in e...
متن کاملMulticast in a Virtually
This paper presents the deenition and solution to the uniform reliable multicast problem in the virtually synchronous environment deened by the Isis system. A uniform reliable multicast of a message m has the property that if m has been received by any destination process (faulty or not), then m is received by all processes that reach a decision. Uniform reliable mul-ticast provides a solution ...
متن کاملOptimization of majority protocol for controlling transactions concurrency in distributed databases by multi-agent systems
In this paper, we propose a new concurrency control algorithm based on multi-agent systems which is an extension of majority protocol. Then, we suggest a clustering approach to get better results in reliability, decreasing message passing and algorithm’s runtime. Here, we consider n different transactions working on non-conflict data items. Considering execution efficiency of some different...
متن کامل